/*
ID: icerupt1
PROG: milk3
LANG: C++11
*/
#include <fstream>
using namespace std;

int const maxn = 21;
bool visited[maxn][maxn][maxn];
bool ans[maxn];
int a, b, c;


void work(int na, int nb, int nc)
{
	if (visited[na][nb][nc]) return;
	visited[na][nb][nc] = true;
	if (na == 0) ans[nc] = true;
	work(min(a-na, nc)+na,       nb        , nc-min(a-na, nc));
	work(      na        , min(b-nb, nc)+nb, nc-min(b-nb, nc));

	work(na-min(b-nb, na), nb+min(b-nb, na),        nc       );
	work(na-min(c-nc, na),        nb       , nc+min(c-nc, na));

	work(na+min(a-na, nb), nb-min(a-na, nb),        nc       );
	work(       na       , nb-min(c-nc, nb), nc+min(c-nc, nb));
}

int main()
{
	ifstream fin {"milk3.in" };
	ofstream fout{"milk3.out"};

	fin >> a >> b >> c;
	work(0, 0, c);
	int first = 0;
	for (; first <=c; first++)
		if (ans[first]) break;
	fout << first;
	for (int i = first+1; i <= c; i++)
		if (ans[i]) fout << " " << i;
	fout << "\n";
}
